منابع مشابه
The Covering Path Problem on a Grid
This paper introduces the covering path problem on a grid (CPPG) which finds the costminimizing path connecting a subset of points in a grid such that each point is within a predetermined distance of a point from the chosen subset. We leverage the geometric properties of the grid graph which captures the road network structure in many transportation problems, including our motivating setting of...
متن کاملThe Painter's Problem: Covering a Grid with Colored Connected Polygons
Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors χ. Each cell s in the grid is assigned a subset of colors χs ⊆ χ and should be partitioned such that for each color c ∈ χs at least one piece in the cell is identified with c. Cells assigned the empty color set remain white. We focus on the case where χ = {red, blue...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملOn a Cone Covering Problem
Given a set of polyhedral cones C1, · · · , Ck ⊂ R, and a convex set D, does the union of these cones cover the set D? In this paper we consider the computational complexity of this problem for various cases such as whether the cones are defined by extreme rays or facets, and whether D is the entire R or a given linear subspace R. As a consequence, we show that it is coNP-complete to decide if ...
متن کاملA note on the Covering Steiner Problem
A randomized approximation algorithm for the undirected and directed covering Steiner Problems is presented. The algorithm is based on a randomized reduction to a problem called 12 -Group Steiner. For the undirected case, the approximation ratio matches the approximation ratio of Konjevod et al. [KRS01]. However, our approach is a lot simpler. For the directed covering Steiner this gives an O(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2019
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2019.0901